Estimating Good Discrete Partitions from Observed Data: Symbolic False Nearest Neighbors
نویسندگان
چکیده
منابع مشابه
Estimating good discrete partitions from observed data: symbolic false nearest neighbors.
A symbolic analysis of observed time series requires a discrete partition of a continuous state space containing the dynamics. A particular kind of partition, called "generating," preserves all deterministic dynamical information in the symbolic representation, but such partitions are not obvious beyond one dimension. Existing methods to find them require significant knowledge of the dynamical ...
متن کاملFinding Data Broadness Via Generalized Nearest Neighbors
A data object is broad if it is one of the k-Nearest Neighbors (k-NN) of many data objects. We introduce a new database primitive called Generalized Nearest Neighbor (GNN) to express data broadness. We also develop three strategies to answer GNN queries efficiently for large datasets of multidimensional objects. The R*-Tree based search algorithm generates candidate pages and ranks them based o...
متن کاملEstimating a generating partition from observed time series: symbolic shadowing.
We propose a deterministic algorithm for approximating a generating partition from a time series using tessellations. Using data generated by Hénon and Ikeda maps, we demonstrate that the proposed method produces partitions that uniquely encode all the periodic points up to some order, and provide good estimates of the metric and topological entropies. The algorithm gives useful results even wi...
متن کاملEstimating survival from partially observed data
Often, in cross-sectional-follow-up studies, survival data are obtained from prevalent cases only. This sampling mechanism introduces lenght-bias. An added difficulty is that in some cases the times of the onset cannot be ascertained or are recorded with great uncertainty. Such was the situation in the Canadian Study of Health and Aging (CSHA), an ongoing nation-wide study of dementia conducted...
متن کاملk*-Nearest Neighbors: From Global to Local
The weighted k-nearest neighbors algorithm is one of the most fundamental nonparametric methods in pattern recognition and machine learning. The question of setting the optimal number of neighbors as well as the optimal weights has received much attention throughout the years, nevertheless this problem seems to have remained unsettled. In this paper we offer a simple approach to locally weighte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2003
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.91.084102